Strongly hyperbolic systems of maximal rank
نویسندگان
چکیده
منابع مشابه
Strongly Hyperbolic Systems in General Relativity *
We discuss several topics related to the notion of strong hyperbolicity which are of interest in general relativity. After introducing the concept and showing its relevance we provide some covariant definitions of strong hyperbolicity. We then prove that is a system is strongly hyperbolic with respect to a given hypersurface, then it is also strongly hyperbolic with respect to any near by one. ...
متن کاملHyperbolic Rank of Products
Generalizing a result of Brady and Farb (1998), we prove the existence of a bilipschitz embedded manifold of negative curvature bounded away from zero and dimension m1 +m2 − 1 in the product X := X1 1 ×X m2 2 of two Hadamard manifolds Xi i of dimension mi with negative curvature bounded away from zero. Combining this result with a result of Buyalo and Schroeder (2002), we prove the additivity o...
متن کاملThe Geometry of Rank 2 Hyperbolic Root Systems
Let ∆ be a rank 2 hyperbolic root system. Then ∆ has generalized Cartan matrix H(a, b) = ( 2 −b −a 2 ) indexed by a, b ∈ Z with ab ≥ 5. If a 6= b, then ∆ is non-symmetric and is generated by one long simple root and one short simple root, whereas if a = b, ∆ is symmetric and is generated by two long simple roots. We prove that if a 6= b, then ∆ contains an infinite family of symmetric rank 2 hy...
متن کاملStrongly Degenerate Parabolic-Hyperbolic Systems Modeling Polydisperse Sedimentation with Compression
We show how existing models for the sedimentation of monodisperse flocculated suspensions and of polydisperse suspensions of rigid spheres differing in size can be combined to yield a new theory of the sedimentation processes of polydisperse suspensions forming compressible sediments (“sedimentation with compression” or “sedimentation-consolidation process”). For N solid particle species, this ...
متن کاملListing Maximal Subgraphs in Strongly Accessible Set Systems
Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U ,F) uses a ground set U (e.g., the network nodes) and an indicator F ⊆ 2U of which subsets of U have the required property. For the problem of listing all sets in F maximal under inclusion, the ambitious goal is to cover ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences
سال: 1997
ISSN: 0034-5318
DOI: 10.2977/prims/1195145016